Metric Temporal Logic with Counting
نویسندگان
چکیده
Ability to count number of occurrences of events within a specified time interval is very useful in specification of resource bounded real time computation. In this paper, we study an extension of Metric Temporal Logic (MTL) with two different counting modalities called C and UT (until with threshold), which enhance the expressive power of MTL in orthogonal fashion. We confine ourselves only to the future fragment of MTL interpreted in a pointwise manner over finite timed words. We provide a comprehensive study of the expressive power of logic CTMTL and its fragments using the technique of EF games extended with suitable counting moves. Finally, as our main result, we establish the decidability of CTMTL by giving an equisatisfiable reduction from CTMTL to MTL. The reduction provides one more example of the use of temporal projections with oversampling introduced earlier for proving decidability. Our reduction also implies that MITL extended with C and UT modalities is elementarily decidable.
منابع مشابه
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover no temporal logic with a finite set of modalities can express all the natural generalizations of this modality. The temporal logic with counting modalities (TLC ) is the extension of until-since temporal logic TL(U,S...
متن کاملContinuous time temporal logic with counting
We add to the standard temporal logic TL(U,S) a sequence of “counting modalities”: For each n the modality Cn(X), which says that X will be true at least at n points in the next unit of time, and its dual ←− C n, which says that X has happened n times in the last unit of time. We show that this temporal logic is expressively complete for the metric predicate logic Q2MLO, which is expressive, de...
متن کاملExpressiveness of Metric Modalities for Continuous Time
We prove a conjecture by A. Pnueli and strengthen it showing a sequence of “counting modalities” none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals. Moreover, there is no finite temporal logic that can express all of them over the real line, so that no finite metric temporal logic is expressively complete.
متن کاملWhen is Metric Temporal Logic Expressively Complete?
A seminal result of Kamp is that over the reals Linear Temporal Logic (LTL) has the same expressive power as first-order logic with binary order relation < and monadic predicates. A key question is whether there exists an analogue of Kamp’s theorem for Metric Temporal Logic (MTL) – a generalization of LTL in which the Until and Since modalities are annotated with intervals that express metric c...
متن کاملThe expressiveness of MTL with counting
It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities Cn that assert a properties holds n times in the next time interval. We show that MTL with the counting modalities, MTL+C, is expressively complete for FO(<,+1). This result strongly supports the assertion...
متن کامل